Tailoring UNITY to Distributed Program Design
نویسندگان
چکیده
As a general framework, UNITY does not offer any specific facility for the design of distributed systems. For such systems, distribution aspects must be represented at a low level, resulting into intricated models and proofs. To provide a more abstract view of distributed systems, we propose two extensions to UNITY. The first one is an observation relation which is integrated in UNITY semantics to provide an abstract communication mechanism. The second one is a mapping operator which accounts for the true parallelism of distributed systems. The paper illustrates, through different examples, how these extensions can be used to help the design of distributed systems in UNITY.
منابع مشابه
Towards a Compositional Approach to the Design and Verification of Distributed Systems
We are investigating a component-based approach for formal design of distributed systems. In this paper, we introduce the framework we use for specification, composition and communication and we apply it to an example that highlights the different aspects of a compositional design, including top-down and bottom-up phases, proofs of composition, refinement proofs, proofs of program texts, and co...
متن کاملFormal Methods and Mechanical Veriication Applied to the Development of a Convergent Distributed Sorting Program
Gentle introductions to the programming logic UNITY, the theorem proving environment HOL, and the embedding of the rst into the latter are presented. Equipped with this apparatus a methodology for designing distributed algorithms is described. Finally this methodology is used to design and proof the correctness of a convergent distributed sorting algorithm.
متن کاملA UNITY Mapping Operator for Distributed Programs
When describing a distributed application within the Unity framework, one usually uses the composition by union to express the interaction between processes. Unfortunately, the semantics of union is not well-suited to express the possible true parallelism between the diier-ent parts of a program. However, the diierent processes of a distributed application do not share any memory. Thanks to thi...
متن کاملRevising Distributed UNITY Programs Is NP-Complete
We focus on automated revision techniques for adding Unity properties to distributed programs. We show that unlike centralized programs where multiple safety properties and one progress property can be added in polynomial-time, addition of a safety or a progress Unity property to distributed programs is significantly more difficult. Precisely, we show that such addition is NP-complete in the si...
متن کاملDistributed Diners From UNITY Speci cation to CC Implementation
Resource con icts may typically be described as the dining philoso phers problem or diners for short In this report we derive a distributed message passing solution to the diners problem from the shared memory solution presented in CM Ch Dining Philosophers We de ne an isomorphism between variables in the shared memory state and variables in the distributed state This allows us to translate the...
متن کامل